Wireless communication system using joined transmit and receive processing

ABSTRACT

A wireless communication system comprises a base transceiver station and R remote transceivers T 1  . . . T R , each of the remote transceivers having multiple antennas. The base transceiver station has N base station antennas, each of the remote transceivers has M remote antennas, and N≧R. The base transceiver station simultaneously transmits information signals s 1  . . . s R  to remote transceivers T 1  . . . T R , respectively. The base transceiver station comprises processing means for selecting R discrimination vectors V 1  . . . V R , each of the discrimination vectors having N components. The base transceiver station computes an N-component transmission signal vector U as follows:        U   =       ∑     i   =   1     R                       V   i            s   i     .                         
     The transmission signal vector U is transmitted from the base transceiver station, preferably one component of U per base station antenna. The i th  remote transceiver T i  receives an M-component signal vector Z i  through its M remote antennas, one component of Z i  per antenna. The i th  remote transceiver computes a reconstructed signal y i  from the received signal vector Z i . The discrimination vectors V 1  . . . V R  are preferably selected to optimize an efficiency of transmission, and the computation of y i  preferably optimizes an efficiency of reception. Some embodiments of the present system and method employ time filtering, and some embodiments use frequency filtering.

FIELD OF THE INVENTION

This invention relates generally to wireless communication systems, and more particularly to wireless communication systems using a base transceiver station and remote transceivers, wherein both the base transceiver station and the remote transceivers have multiple antennas and signal processing capabilities.

BACKGROUND

Wireless communication is becoming an increasingly common form of communication, and the demand for wireless service continues to grow. The sources of demand include cellular mobile communication networks, wireless local area computer networks, wireless telephone networks, wireless cable TV, multi-user paging systems, high frequency modems, and more. Current implementations of these communication systems are all confined to limited frequency bands of operation either by practical considerations or by government regulation. As the capacity of these systems has been reached, demand for more service is met by allocating more frequency spectrum to the particular application and by utilizing the allocated spectrum more efficiently. In light of the basic physical principle that transmission of information requires bandwidth, the fundamental limitations of a finite amount of practically usable spectrum present a substantial barrier to meeting an exponentially increasing demand for wireless information transmission.

Conventional wireless communication systems attempt to solve the problem of high demand by using different multiple access schemes, the most common being frequency-division multiple access (FDMA), time-division multiple access (TDMA), and code-division multiple access (CDMA). All current systems employ FDMA, wherein the available frequency bandwidth is sliced into multiple frequency channels and signals are transmitted over the different channels simultaneously.

Current wireless systems also use TDMA, wherein multiple users share a common frequency channel by doing so at different times. Typically, analog data such as voice is digitized, compressed, then sent in bursts over an assigned frequency channel in assigned time slots. By interleaving multiple users in the available time slots, the number of simultaneous users of the system is increased.

CDMA allows multiple users to share a common frequency channel by using coded modulation schemes. The technology involves preprocessing the signal to be transmitted by digitizing it, modulating a wideband coded pulse train, and transmitting the modulated coded signal in the assigned channel. Multiple users are given distinct codes which decoders in the receivers are programmed to detect.

Another scheme for increasing the capacity of a wireless communication system is spatial division multiple access (SDMA), as discussed by Roy, III et al. in U.S. Pat. No. 5,642,353. SDMA exploits the spatial separation of a number of users to serve the users within the same conventional channel (that is, within the same time slot in the case of TDMA, frequency slot in the case of FDMA, and code in the case of CDMA). In this case, efficient exploitation of the spatial dimension to increase capacity requires the ability to separate a number of users simultaneously communicating on the same channel at the same time in the same local area (or cell).

The above mentioned separation of user up-link and down-link signals can be based on the direction of arrival (DOA) of the individual signals, as described in U.S. Pat. No. 5,828,658 by Ottersten et al. The DOA should be estimated accurately enough to enable the separation. If the users are close to each other, or if the signals are scattered many times, the DOA estimates are inaccurate. In these cases the SDMA technique fails because the separation of the signals is impossible.

As described in U.S. Pat. No. 5,592,490 by Barratt et al., the SDMA separation of signals can also be based on the transmit and receive spatial signatures. The transmit spatial signature characterizes how the remote terminal receives signals from each of the antenna array elements at the base station. The receive spatial signature characterizes how the base station antenna array receives signals from a particular remote terminal. The base station uses these spatial signatures to form multiple beams simultaneously so that each beam maximizes signal reception for one remote terminal. Whereas the receive spatial signatures can be determined by the remote user upon reception, the transmit spatial signatures must be known prior to transmission. Feedback from the remote terminals is necessary to enable computation of the transmit spatial signatures.

FIG. 1 shows the operation of SDMA downlink, considering two remote terminals for example. During downlink, information is transmitted from a base transceiver station (BTS) to the remote terminals. (During uplink, information is transmitted from the remote users to the base transceiver station.) The BTS must have knowledge of the spatial signatures prior to transmission. An accurate estimate of the spatial signatures—or more generally, knowledge of the channels between the BTS and the remote terminals—is necessary to enable SDMA communication. As the accuracy of the channel estimate (or spatial signature estimate) deteriorates, SDMA communication becomes prone to error. In the extreme case when channel knowledge is absent, SDMA is impossible.

In present SDMA systems, the base station has multiple antennas, and each remote terminal has one antenna. Processing is carried out at the base station during both uplink and downlink operation. These SDMA systems require accurate channel knowledge, and this knowledge can only be gained by recording how signals sent from the base station are attenuated and phase-shifted by the time they are received remotely. This information, recorded at the remote units, must be sent back to the base station so that the channels may be computed by data processors. By the time this feedback and computation has occurred, the channel will have changed. (Wireless communication channels are constantly changing since the remote users, as well as the objects from which their signals are reflected, are in general moving.) Therefore, present wireless systems cannot reliably estimate the transmit spatial signatures accurately enough to make SDMA practical.

OBJECTS AND ADVANTAGES

It is therefore a primary object of the present invention to provide a system and method for wireless communication that allows multiple users to share the same time slot, frequency slot, and code, even in the absence of accurate transmit channel knowledge. It is a further object of the present invention to provide a wireless communication system wherein signal processing is distributed between the base transceiver station and the remote transceivers.

The present invention has the advantage of providing a system and method of multiple access that is reliable on both downlink and uplink, even when transmit channels are unknown or rapidly changing.

SUMMARY

A wireless communication system comprises a base transceiver station and remote transceivers having multiple antennas. Each of the remote transceivers comprises M remote antennas, wherein M is a number greater than 1. The base transceiver station comprises N base station antennas, wherein N is a number greater than 1. The base transceiver station services R remote transceivers T₁ . . . T_(R) on the same conventional channel, wherein R≦N.

Information signals s₁ . . . s_(R) are simultaneously transmitted from the base transceiver station to remote transceivers T₁ . . . T_(R), respectively. The base transceiver station comprises processing means for selecting R discrimination vectors V₁ . . . V_(R), each of the discrimination vectors having N components. The base transceiver station computes an N-component transmission signal vector U as follows: $U = {\sum\limits_{i = 1}^{R}\quad {V_{i}{s_{i}.}}}$

The transmission signal vector U is transmitted from the base transceiver station, preferably one component of U per base station antenna.

The i^(th) remote transceiver T_(i) receives an M-component signal vector Z_(i) through its M remote antennas, one component of Z_(i) per antenna. The i_(th) remote transceiver computes a reconstructed signal y_(i) from the received signal vector Z_(i).

In a preferred embodiment, the discrimination vectors V₁ . . . V_(R) are selected to be linearly independent, preferably orthogonal. In another preferred embodiment, the vectors V₁ . . . V_(R) are selected to optimize an efficiency of transmission of information signals s₁ . . . s_(R) to remote transceivers T₁ . . . T_(R), respectively. The efficiency is measured, for example, by the strength of the i^(th) information signal si at transceiver T_(i), or by the interference due to s_(i) at remote transceivers other than T_(i).

Remote transceiver T_(i) computes reconstructed signal y_(i) using either a linear or a nonlinear relationship between y_(i) and Z_(i). When a linear relationship is used, remote transceiver T_(i) selects an M-component signature vector W_(i), and computes y_(i) according to y_(i)=W_(i)*·Z_(i). Vector W_(i) is preferably selected to maximize a signal quality parameter ρ_(i) that measures the quality of reconstructed signal y_(i). Signal quality parameter ρ_(i) is typically defined using an M×N channel matrix H_(i) that models a channel between the base transceiver station and remote transceiver T_(i). In some embodiments, signal quality parameter ρ_(i) is a signal to interference ratio, equal to ${{W_{i}^{*}H_{i}V_{i}}}^{2}/{\sum\limits_{j \neq 1}{{{W_{i}^{*}H_{i}V_{j}}}^{2}.}}$

During uplink, transceiver T_(i) transmits a remote information signal s_(i)′ by selecting an M-component remote processing vector W_(i)′ and transmitting the product W_(i)′s_(i)′, one component per antenna. The vector W_(i) is preferably selected to optimize a remote transmission quality parameter.

The base transceiver station receives an N-component base station received signal vector X during uplink. The N components of vector X correspond to the N base station antennas. The base transceiver station selects N-component signature vectors V₁′ . . . V_(R)′, and computes base station reconstructed signals u₁ . . . u_(R) corresponding to signals sent from transceivers T₁ . . . T_(R), respectively, according to the formula: u_(i)=V_(i)′*·X. The signature vectors V₁′ . . . V_(R)′ are preferably selected to optimize base station reception quality parameters.

Some embodiments of the present system and method employ time filtering, and some embodiments use frequency filtering. In these embodiments, the transmission signal vector U is computed using p-component information vectors S₁ . . . S_(R) and N×p discrimination matrices V₁ . . . V_(R) as follows: $U = {\sum\limits_{i = 1}^{R}\quad {V_{i}{S_{i}.}}}$

Upon receiving signal vector Z_(i), remote transceiver T_(i) uses signal vector Z_(i) to compute a reconstructed signal vector Y_(i). In case of time filtering, the reconstructed signal vector Y_(i) has only one component and it is computed from p′ consecutive signal vectors Z_(i). p′ is a function of time of flight (ToF) difference between multipaths. In case of frequency filtering (for example when Orthogonal frequency Division Multiplexing [OFDM] is used), the reconstructed signal vector Y_(i) has p components computed from each signal vector Z_(i).

The wireless system of the present invention operates consistently better than prior art SDMA systems, even when the base transceiver station or remote transceiver lacks accurate transmit channel data. The improvement occurs because (1) the multiple antennas of the remote transceivers are used advantageously, and (2) the remote transceivers possess signal processing capabilities, so the remote transceivers do not need to wait for the base transceiver station to perform all of the processing.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 shows a prior art wireless communication system employing spatial division multiple access.

FIG. 2 shows an example of a wireless communication system according to the present invention.

FIG. 3 shows a schematic of a base station transmission processor belonging to a base transceiver station according to a preferred embodiment of the present invention.

FIG. 4 shows a remote reception processor of a remote transceiver according to the preferred embodiment.

FIG. 5 shows a remote transmission processor belonging to the remote transceiver.

FIG. 6 shows a reception processor of the base transceiver station.

FIG. 7 is a graph of performances of the present invention and of the prior art.

DETAILED DESCRIPTION

FIG. 2 illustrates a wireless communication system according to the present invention. The wireless communication system comprises a base transceiver station (BTS) 10 and remote transceivers T₁ and T₂. Preferably, remote transceivers T₁ and T₂ share the same conventional channel. That is, both of the remote transceivers share the same frequency slot when FDMA is used; the remote transceivers share the same time slot when TDMA is used; and the remote transceivers share the same code when CDMA is used.

Remote transceiver T₁ comprises remote antennas 18A and 18B. Remote transceiver T₂ comprises remote antennas 20A and 20B. In general, the remote transceivers of the wireless communication system comprise M remote antennas, wherein M is a number greater than 1. In the example of FIG. 2, M=2.

Base transceiver station 10 comprises base station antennas 12A and 12B. The base station antennas compose an array 14 of base station antennas. In general, BTS 10 comprises N base station antennas, wherein N is a number greater than 1. In the example of FIG. 2, N=2.

BTS 10 is able to service a number R of independent remote transceivers T₁ . . . T_(R) that share the same conventional channel. In general, R≦N. In the embodiment shown in FIG. 2, R=2.

Two meanings of the word “channel” are commonly used when discussing wireless systems, and both meanings are used here. The first definition, already alluded to, describes the frequency slot, time slot, and code in FDMA, TDMA, and CDMA systems, respectively. The word “channel” also describes the path between a transmitter and a receiver. In FIG. 2, signals travel in a channel 22 to reach remote transceiver T₁ from BTS 10. Similarly, signals propagate through a channel 24 when BTS 10 communicates with remote transceiver T₂. In general, channels can include line-of-sight paths as well as one or more reflected paths. Some channels contain only reflected paths.

Downlink—Base Transceiver Station

Base transceiver station 10 comprises a base station transmission processor 30, shown in FIG. 3. First and second data streams D₁ and D₂ contain information that is to be transmitted. The data streams are preferably bit streams. Base station transmission processor 30 prepares the data streams for transmission as follows.

First data stream D₁ is processed by an interleaving and coding unit 32A, which performs standard interleaving and error-correction coding operations on first data stream D₁. The first data stream is then processed by a frame formation unit 34A, which gives data stream D₁ a desired temporal structure according to well known principles. For example, when TDMA is used, frame formation unit 34A ensures that data stream D₁ occupies the desired time slot. Frame formation unit 34A also receives input from a training unit 42, which generates training sequences. Frame formation unit 34A incorporates the training sequences into data stream D₁.

Frame formation unit 34A maps the bits of data stream D₁ to symbols, using any known technique such as quadrature amplitude modulation (QAM). Frame formation unit 34A outputs an information signal s₁, wherein information signal s₁ is a symbol stream. Other methods for generating symbol streams are known in the art and may be used to generate information signal s₁.

A second data stream D₂ is similarly processed by an interleaving and coding unit 32B and a frame formation unit 34B, resulting in an information signal s₂. Information signal s₂ is also a symbol stream. Information signal s₁ enters a first multiplier 36A that multiplies information signal s₁ by a first discrimination vector V₁ to obtain V₁s₁. In the example of FIG. 3, vector V₁ has two components V₁₁ and V₁₂, and each component is in general complex. Similarly, a second multiplier 36B multiplies information signal s₂ by a second discrimination vector V₂ to obtain V₂s₂. In the example of FIG. 3, vector V₂ has two complex components V₂₁ and V₂₂. The values of discrimination vectors V₁ and V₂ are determined by a vector computation unit 46. The determination of the discrimination vectors is described in detail below.

First multiplier 36A outputs the first component of V₁s₁, V₁₁s₁, to an adder 38A. Second multiplier 36B outputs the first component of V₂s₂, V₂₁s₂, to adder 38A. Adder 38A generates a transmission signal U₁, wherein U₁=V₁₁s₁+V₂₁s₂. Similarly, an adder 38B produces a transmission signal U₂=V₁₂s₁+V₂₂s₂ from outputs from multipliers 36A and 36B. The combined result of adders 38A and 38B is a transmission signal vector U=(U₁,U₂), wherein $U = {\sum\limits_{i}{V_{i}{s_{i}.}}}$

Transmission signal U₁ is then sent to a radio frequency (RF) up-conversion unit 40A. Up-conversion unit 40A prepares U₁ to be transmitted from base station antenna 12A according to known principles. Preferably, up-conversion unit 40A comprises the following components: a pulse-shaping filter, a digital-to-analog-converter, an intermediate frequency modulator, a radio-frequency converter, and an amplifier. Transmission signal U₁ sequentially passes through the above components of up-conversion unit 40A prior to transmission.

Similarly, transmission signal U₂ is up-converted by an RF up-conversion unit 40B. Transmission signals U₁ and U₂ are transmitted from base station antennas 12A and 12B, respectively, after being up-converted.

Although a particular embodiment of the base station transmission processor is shown in FIG. 3, the invention is not limited to this embodiment. In general, R information signals s₁ . . . s_(R) are generated from R data streams D₁ . . . D_(R), respectively. Transmission signal vector U is then computed using the R information signals and R discrimination vectors V₁ . . . V_(R). In general, the discrimination vectors each have N components, and transmission signal vector U also has N components. The transmission signal vector is given by: $\begin{matrix} {U = {\sum\limits_{i = 1}^{R}\quad {V_{i}{s_{i}.}}}} & (1) \end{matrix}$

The transmission signal vector is then transmitted from the N base station antennas. In the preferred embodiment, there is a one-to-one correspondence between the components of U and the base station antennas. For example, the first component of U is transmitted from the first base station antenna; the second component of U is transmitted from the second antenna, and so on. In alternative embodiments, each of the base station antennas transmits a linear combination of the components of U.

The discrimination vectors V₁ . . . V_(R) are preferably selected to enable remote transceiver T₁ to receive information signal s₁, remote transceiver T₂ to receive information signal s₂, and so on, with optimum efficiency. The discrimination vectors can be chosen in a variety of ways to achieve this goal.

In a first method of selecting V₁ . . . V_(R), the discrimination vectors are chosen to be linearly independent. In a preferred embodiment of this method, the discrimination vectors are orthogonal. Default values for an orthogonal set of discrimination vectors are preferably stored in a data bank 44, as shown in FIG. 3. Vector computation unit 46 uses the default values from data bank 44 and sends them to multipliers 36A and 36B. This first method of selecting V₁ . . . V_(R) is preferably used when there is little or no information at the base transceiver station about the channels between the base transceiver station and the remote transceivers T₁ . . . T_(R).

The channels between the base transceiver station and the remote transceivers T₁ . . . T_(R) are characterized by channel matrices H₁ . . . H_(R), respectively. Each channel matrix is an M×N matrix, corresponding to the N base station antennas of the base transceiver station and the M remote antennas of each remote transceiver. The (i,j) element of H_(k) characterizes how a signal sent from the j^(th) base station antenna is received by the i^(th) remote antenna of remote transceiver T_(k). In other words, when the N base station antennas transmit an N-component vector A (one component from each base station antenna), remote transceiver T_(k) receives an M-component vector B=H_(k) A (one component through each remote antenna). Here standard matrix multiplication is indicated by the product H_(k) A. In the embodiment of FIG. 2, H₁ describes channel 22, and H₂ describes channel 24.

In a second method of selecting V₁ . . . V_(R), the i^(th) discrimination vector V_(i) is selected to minimize a measure of interference μ_(i) due to the presence of i^(th) information signal s_(i) at remote transceivers other than T_(i). In one embodiment, the measure of interference is calculated as: $\mu_{i} = {\sum\limits_{j \neq 1}\quad {{{H_{j}V_{i}}}^{2}.}}$

Thus, in this embodiment, vector computation unit 46 selects V_(i) to minimize μ_(i), for i=1 . . . R.

To enable the second method of selecting V₁ . . . V_(R), the channel matrices H₁ . . . H_(R) must be approximately known. These channel matrices are obtained by channel characteristics extractor 50, shown in FIG. 3. The channel characteristics extractor then delivers the channel matrices to vector computation unit 46.

In the case of time division duplexing (TDD), channel characteristics extractor 50 infers the channel matrices from transmissions from the remote transceivers. This is possible because when TDD is used, the base transceiver station transmits and receives over the same frequency channels.

When frequency division duplexing (FDD) is used, the base transceiver station transmits over different frequencies than those by which it receives. Channel matrices at one frequency cannot be used to reliably predict channel matrices at another frequency if the frequencies are spaced widely apart. Therefore in this case, the channel characteristics extractor preferably uses explicit feedback from the remote transceivers to determine the channel matrices. (In some embodiments where the transmit and receive frequencies are close together, channel characteristics extractor 50 infers the channel matrices from transmissions from the remote transceivers.)

In any case, channel characteristics extractor 50 models the channels to remote transceivers T₁ . . . T_(R) by channel matrices H₁ . . . H_(R), respectively. A control logic unit 48 determines whether (1) vector computation unit 46 uses the channel matrices to find optimum values for V₁ . . . V_(R), or (2) vector computation unit 46 uses the default values stored in data bank 44. Control logic unit 48 also controls training unit 42.

In a third method of selecting V₁ . . . V_(R), the i^(th) discrimination vector V_(i) is selected to maximize a signal quality τ_(i) of the i^(th) information signal s_(i). In one embodiment, signal quality τ_(i) is calculated as: τ_(i)=|H_(i)V_(i)|². In this embodiment, V_(i) maximizes τ_(i), for i=1 to R.

In the preferred embodiment, information signals s₁ . . . s_(R) share the same conventional channel. That is, the information signals, when broadcast as transmission signal vector U, share the same conventional multiple access slots. In alternative embodiments, the information signals occupy different conventional channels.

As shown in FIG. 3, base station transmission processor 30 comprises interleaving and coding units 32A and 32B, frame formation units 34A and 34B, multipliers 36A and 36B, and adders 38A and 38B. The base station transmission processor also comprises training unit 42, data bank 44, vector computation unit 46, control logic unit 48, and channel characteristics extractor 50.

The above discussion applies when there is little or no inter-symbol interference, or ISI. In many applications, however, the channels between the base transceiver station and the remote transceivers are multipath, with each of the multiple paths having its own characteristic time delay. This means that, for example, remote transceiver T₁ may simultaneously receive a first symbol sent from the base transceiver station at a time t₁, and a second symbol sent at a time t₂. The time of flight difference t₂−t₁ corresponds to the difference in path lengths between two paths belonging to the channel to remote transceiver T₁. Since the remote transceiver receives more than one symbol at one time, inter-symbol interference takes place.

To mitigate this problem, equalization techniques such as time filtering are well known in the art. For example when time filtering is used, linear combination of a number of symbols are transmitted at once to each remote transceiver. The number of simultaneous symbols transmitted to transceiver T₁, for example, is a function of the largest time of flight difference between the channel paths, or channel taps, composing the channel to transceiver T₁.

The present invention also allows for time filtering. When time filtering is used, information signals s₁ . . . s_(R) are replaced by information vectors S₁ . . . S_(R), wherein each of the information vectors comprises p components, and each component is a time delayed symbol. The number p is chosen to implement the time filtering described above. In this embodiment, discrimination vectors V₁ . . . V_(R) are replaced by N×p discrimination matrices V₁ . . . V_(R). (The matrices are distinguished from the vectors typographically by the absence of bold-face type.) Transmission signal vector U is then computed as: $\begin{matrix} {U = {\sum\limits_{i = 1}^{R}\quad {V_{i}S_{i}}}} & \text{(1a)} \end{matrix}$

As before, transmission signal vector U is an N-component vector.

In another embodiment, frequency filtering is used. In this embodiment, the base transceiver station broadcasts to each of the remote transceivers over multiple sub-carrier frequencies (like in case of OFDM) simultaneously. In this embodiment, information signals s₁ . . . s_(R) are again replaced by p-component information vectors S₁ . . . S_(R), but in this embodiment, p is the number of the sub-carrier frequencies used. The N×p discrimination matrices V₁ . . . V_(R) are used, and in this case are optimized for frequency filtering. Eq. (1a) is used to compute the N-component transmission signal vector U.

Downlink—Remote Transceiver

Remote transceiver T₁ comprises a remote reception processor 60, shown in FIG. 4. Remote antennas 18A and 18B receive signals from the base transceiver station. The signals from remote antennas 18A and 18B are down-converted by RF down-converters 62A and 62B, respectively, to obtain received signals Z₁₁ and Z₁₂, respectively. The received signals are referred to collectively as a received signal vector Z₁, wherein Z₁=(Z₁₁, Z₁₂) In general, remote transceiver T₁ has M remote antennas, and received signal vector Z₁ correspondingly has M components.

RF down-converter 62A operates according to known techniques and preferably comprises an RF amplifier, a mixer, a demodulator, and an analog-to-digital converter. Received signal Z₁₁ is generally a stream of complex numbers. Similarly, RF down-converter 62B uses amplification, frequency mixing, demodulation, and A/D techniques to produce received signal Z₁₂. Received signal Z₁₂ is also a stream of complex numbers, in general. Received signal vector Z₁ is converted into a received data stream by remote reception processor 60 as follows.

The components of vector Z₁ are input into a signal processor 64 that generates a reconstructed signal y₁ from the vector Z₁. The reconstructed signal y₁ approximates information signal s₁.

In some embodiments, reconstructed signal y₁ is obtained from received signal vector Z₁ using an M-component signature vector W₁. Reconstructed signal y₁ is given by the formula:

y₁=W₁*·Z₁.  (2)

That is, y₁ depends linearly upon Z₁. In Eq. (2) and below, the asterisk stands for complex conjugation and transposition. The multiplication implied by Eq. (2) is the standard vector dot product.

The value of signature vector W₁ is determined by a remote vector computation unit 66, which outputs vector W₁ to signal processor 64. The output of signal processor 64 is reconstructed signal y₁.

A detection, deinterleaving and decoding unit 70 processes reconstructed signal y₁ according to standard principles to produce the received data stream. In particular, detection, deinterleaving and decoding unit 70 detects symbols in reconstructed signal y₁, converts the symbols to bits, then deinterleaves and decodes the bits to produce the received data stream. The received data stream is a bit stream.

Signature vector W₁ is preferably selected to maximize a received signal quality parameter ρ₁. The parameter ρ₁ quantifies the accuracy with which reconstructed signal y₁ duplicates information signal s₁. In one embodiment, the received signal quality parameter ρ_(i) is equal to a signal to interference ratio: $\begin{matrix} {\rho_{1} = {{{W_{1}^{*}H_{1}V_{1}}}^{2}/{\sum\limits_{i \neq 1}\quad {{{W_{1}^{*}H_{1}V_{i}}}^{2}.}}}} & (3) \end{matrix}$

The numerator in Eq. (3) is proportional to the signal strength at remote transceiver T₁; the denominator is proportional to the interference at T₁ due to signals s₂ . . . s_(R). Standard vector and matrix multiplication is implied, so that, for example, W₁*H₁V₁ is a scalar quantity.

To implement the method using Eq. (3) above, the quantities H₁V_(i) must be substantially accurately known, for i=1 to R. These quantities are determined by a channel estimation unit 68 during training sequences sent by the base transceiver station. The estimates of H₁V_(i) are then sent from channel estimation unit 68 to remote vector computation unit 66. The remote vector computation unit then finds the value of W₁ that maximizes received signal quality parameter ρ₁. The remote vector computation unit delivers the resultant W₁ to signal processor 64.

The quantities H₁V_(i) characterize the transmit channel from the base transceiver station to remote transceiver T₁. The quantities H₁V_(i) are easily determined by the present system and method, since these quantities are determined by remote transceiver T₁ after receiving a transmission from the base transceiver station. This situation contrasts with conventional SDMA systems, where transmit channel information must be known at the base transceiver station prior to transmission.

In some embodiments, signature vector W₁ is not used to determine reconstructed signal y₁. In these embodiments, reconstructed signal y₁ depends nonlinearly upon received signal vector Z₁. In one example of such an embodiment, an estimate of H₁V₁ is delivered to signal processor 64 from channel estimation unit 68. Signal processor 64 then calculates |Z₁−H₁V₁t_(i)|² for different known symbols t_(i). The value of t_(i) that minimizes the quantity |Z₁−H₁V₁t_(i)|² is then output as a symbol. In this example, detection, deinterleaving and decoding unit 70 does not need to detect symbols in reconstructed signal y₁, since the symbols were already determined during the production of reconstructed signal y₁.

As shown in FIG. 4, remote reception processor 60 comprises signal processor 64, remote vector computation unit 66, channel estimation unit 68, and deinterleaving and decoding unit 70. In general, the R remote transceivers operate simultaneously according to the principles described above for T₁. Remote transceiver T_(i) receives a received signal vector Z_(i) and computes a reconstructed signal y_(i) from the vector Z_(i).

In some embodiments, the remote transceivers are adapted for time filtering; in some embodiments, the remote transceivers are adapted for frequency filtering. In such embodiments, remote transceiver T₁, for example, computes a reconstructed signal vector Y₁ instead of reconstructed signal y₁. In case of time filtering, the reconstructed signal vector Y_(i) has only one component and it is computed from p′ consecutive signal vectors Z_(i). p′ is a function of time of flight (ToF) difference between multipaths. In case of frequency filtering (for example when Orthogonal frequency Division Multiplexing [OFDM] is used), the reconstructed signal vector Y_(i) has p components computed from each signal vector Z_(i). As an example, when linear methods are used, reconstructed signal vector Y₁ depends linearly upon p′ consecutive received signal vectors Z₁₁ . . . Z₁p′, p′ signature vectors W₁₁ . . . W₁p′ are used in place of signature vector W₁, and reconstructed signal vector Y₁ is computed as: $\begin{matrix} {Y_{1} = {\sum\limits_{i = 1}^{p^{\prime}}\quad {W_{1i}^{*}Z_{1i}}}} & \text{(2a)} \end{matrix}$

Uplink—Remote Transceiver

During uplink, one or more of the remote transceivers sends a message to the base transceiver station. As shown in FIG. 5, remote transceiver T₁ comprises a remote transmission processor 80 for uplink. Remote transmission processor 80 is analogous to base station transmission processor 30 of FIG. 3. A remote data stream D₁′ is prepared for transmission by remote transmission processor 80.

Remote data stream D₁′ is a bit stream, and is processed by a remote interleaving and coding unit 82 and a frame formation unit 84 to produce a remote information signal s₁′.

Remote information signal s₁′ is a symbol stream. A remote multiplier 86 multiplies the remote information signal by an M-component remote processing vector W₁′ to obtain a remote transmission signal vector U₁′, wherein U₁′=W₁′s₁′.

The M components of the vector U₁′ are transmitted from the M antennas of transceiver T₁, one component per antenna. In the embodiment of FIG. 5, M=2. Remote RF uplink units 98A and 98B convert the first and second components, respectively, of remote transmission signal vector U₁′ to RF signals that are transmitted from remote antennas 18A and 18B, respectively.

In the preferred embodiment, remote processing vector W₁′ is selected to maximize a remote transmission quality parameter r₁. The parameter r₁ is a measure of the quality of transmission from remote transceiver T₁ to the base transceiver station.

In the preferred embodiment, the channel from remote transceiver T₁ to the base station antennas is characterized by an N×M return channel matrix H₁′. Return channel matrix H₁′ is analogous to channel matrix H₁: H₁′ describes transmissions from remote transceiver T₁ to the base transceiver station; H₁ characterizes transmission from the base transceiver station to remote transceiver T₁. When both transmissions occur at the same frequency, as occurs in TDD, H₁′ can be computed from H₁ and vice versa, since the uplink and downlink channels are reciprocal. When uplink and downlink transmissions occur at different frequencies, the matrices H₁ and H₁′ have to be computed independently.

In one embodiment, the remote transmission quality parameter r₁ is calculated as follows. A set of N orthonormal vectors {e₁ . . . e_(N)} is selected, wherein each of the vectors e₁ . . . e_(N) has N components. The parameter r₁ is given by: $\begin{matrix} {r_{1} = {{{e_{1}^{*}H_{1}^{\prime}W_{1}^{\prime}}}^{2}/{\sum\limits_{i \neq 1}{{e_{i}^{*}H_{1}^{\prime}W_{1}^{\prime}}}^{2}}}} & (4) \end{matrix}$

For example, when N=3, a preferred orthonormal basis is: ${e_{1} = \begin{pmatrix} 1 \\ 0 \\ 0 \end{pmatrix}},{e_{2} = \begin{pmatrix} 0 \\ 1 \\ 0 \end{pmatrix}},{e_{3} = {\begin{pmatrix} 0 \\ 0 \\ 1 \end{pmatrix}.}}$

In this case, the numerator of Eq. (4) is proportional to the signal strength due to remote transceiver T₁ at the first base station antenna. The denominator of Eq. (4) is proportional to the sum of the intensities of the signals from T₁ that are received at the second and third base station antennas. In this case, remote processing vector W₁′ is selected to concentrate transmissions from the first remote transceiver onto the first base station antenna. Clearly, other schemes can be used, corresponding to different choices for the orthonormal basis {e₁ . . . e_(N)}.

Referring again to FIG. 5, a remote uplink vector computation unit 88 computes remote processing vector W₁′ either using default values from data bank 90 or by optimizing remote transmission quality parameter r₁. When the parameter r₁ is optimized, remote uplink vector computation unit 88 obtains channel matrix H₁′ from a remote channel characteristics extractor 92. As in the case of the base transceiver's channel characteristics extractor, the remote channel characteristics extractor computes H₁′ either using feedback from the base station, or, in the TDD case, using characteristics of the downlink signal. A remote control logic unit 94 governs data bank 90 and remote channel characteristics extractor 92, as well as a remote training unit 96 that sends training information to remote frame formation unit 84.

The uplink process described above applies to all of the remote transceivers. Remote transceiver T_(i) generates an M-component remote transmission signal vector U_(i)′ using an i^(th) remote information signal s_(i)′ and an i^(th) remote processing vector W_(i)′, wherein U_(i)′=W_(i)′s_(i)′. Preferably, remote processing vector W_(i)′ optimizes an i^(th) remote transmission quality parameter r_(i). As an example, $r_{1} = {{{e_{i}^{*}H_{i}^{\prime}W_{i}^{\prime}}}^{2}/{\sum\limits_{j \neq 1}{{{e_{j}^{*}H_{i}^{\prime}W_{i}^{\prime}}}^{2}.}}}$

As shown in FIG. 5, remote transmission processor 80 comprises remote interleaving and coding unit 82, frame formation unit 84, remote multiplier 86, remote uplink vector computation unit 88, data bank 90, remote channel characteristics extractor 92, remote control logic unit 94, and remote training unit 96.

As discussed before, some embodiments implement time filtering, and some embodiments use frequency filtering. In these embodiments, remote information signal s₁′, for example, is replaced by a p-component remote information vector S₁′, and remote processing vector W₁′ is replaced by an M×p remote processing matrix W₁′. The M-component remote transmission signal vector U₁′ is then computed as: U₁′=W₁′S₁′.

Uplink—Base Transceiver Station

The base transceiver station receives signals from the remote transceivers during uplink. Referring to FIG. 6, base station antennas 12A and 12B receive signals from the remote transceivers. The signals from base station antennas 12A and 12B are down-converted by RF down-converters 102A and 102B, respectively, to obtain base station received signals X₁ and X₂, respectively. The received signals are referred to collectively as a base station received signal vector X, wherein X=(X₁, X₂).

RF down-converters 102A and 102B each preferably comprises an RF amplifier, a frequency mixer, a demodulator, and an analog-to-digital converter. The received signal vector X is produced by the RF down-converters, and the components of received signal vector X are streams of complex numbers. In general, the base transceiver station has an array of N base station antennas, and base station received signal vector X accordingly has N components.

The base transceiver station comprises a reception processor 100, shown in FIG. 6. Reception processor 100 processes the components of vector X to generate base station reconstructed signals u₁ . . . u_(R). The base station reconstructed signals u₁ . . . u_(R) are approximations to remote information signals s′₁ . . . s′_(R), respectively.

In some embodiments, signals u₁ . . . u_(R) are obtained from vector X using N-component base station signature vectors V₁′ . . . V_(R)′. In these embodiments, the i^(th) base station reconstructed signal u_(i) is given by:

u_(i)=V_(i)′*·X  (5)

Reception processor 100 comprises R processing units for performing the operation of Eq. (5), for i=1 to R. In the embodiment of FIG. 6, R=2, and reception processor 100 comprises processing units 104A and 104B, whose outputs are u₁ and u₂, respectively.

The base station signature vectors V₁′ . . . V_(R)′ are determined by a computation unit 106. The vectors V₁′ . . . V_(R)′ are preferably selected to maximize base station reception quality parameters β₁ . . . β_(R). The parameters β₁ . . . β_(R). measure the quality of reception from remote transceivers T₁ . . . T_(R), respectively.

As an example, the base station reception quality parameters in some embodiments are given by: $\begin{matrix} {\beta_{i} = \left| {V_{i}^{\prime*}H_{i}^{\prime}W_{i}^{\prime}} \middle| {}_{2}{/\sum\limits_{j \neq i}} \middle| {V_{i}^{\prime*}H_{j}^{\prime}W_{j}^{\prime}} \middle| {}_{2}. \right.} & (6) \end{matrix}$

Eq. (6) gives a signal to interference ratio for base station reconstructed signal u_(i). The return channel matrices H₁′ . . . H_(R)′ are estimated by a base station channel estimator 108, shown in FIG. 6. Reception processor 100 comprises processing units 104A and 104B, computation unit 106, and base station channel estimator 108.

In some embodiments, base station reconstructed signals u₁ . . . u_(R) depend nonlinearly upon received signal vector X. For example, signal us may be reconstructed using a nonlinear technique analogous to the nonlinear technique described above for producing signal y₁ during downlink.

As already mentioned, some embodiments use time filtering, and some use frequency filtering. In case of frequency filtering such as in OFDM, p-component base station reconstructed signal vectors U₁ . . . U_(R) are computed instead of reconstructed signals u₁ . . . u_(R). As an example, when linear methods are used, the base station reconstructed signal vector U₁ . . . U_(R) depend linearly upon received signal vector X, p×N base station signature matrices V₁′ . . . V_(R)′ are used to compute the reconstructed signal vectors according to: U_(i)=V_(i)′ X.

System Performance

FIG. 7 shows a graph of a performance curve 200 of the system of the present invention, and a performance curve 202 of a conventional SDMA system. The curves of FIG. 7 were generated in a simulation where remote transceiver T₁ receives signals having a 10 dB signal-to-noise ratio before processing. The x-axis of FIG. 7 gives the channel estimation accuracy, which expresses, in dB, the ratio of the matrix elements of H₁ to the uncertainty in those elements. At 0 dB, the ratio is 1:1, and the channel is 50% uncertain.

The y-axis of FIG. 7 gives the signal to interference-plus-noise (SINR) ratio for the reconstructed signal y₁. Curve 200 is always above curve 202. Therefore the wireless system of the present invention performs better than conventional SDMA systems at all levels of channel estimation accuracy.

Although the description above contains many specificities, these should not be construed as limiting the scope of the invention but as merely providing illustrations of some of the presently preferred embodiments. For example, the exact designs of the transmission and reception processors 30, 60, 80, and 100, of FIGS. 3, 4, 5, and 6, respectively, are not crucial to the invention. As is known in the art, the methods outlined above can be implemented using a variety of hardware and software systems.

The above method and system can clearly be used when the number of remote transceivers sharing the same conventional channel, R, is less than or equal to the number of remote antennas, M, belonging to each remote transceiver. However, the present method and system can also be used when R>M by supplementing the present method with conventional SDMA techniques. Therefore the scope of the invention should not be limited to the embodiments described above, but should be determined by the following claims and their legal equivalents. 

We claim:
 1. In a wireless communication system comprising a base transceiver station, said base transceiver station comprising an array of N base station antennas; a method for simultaneously sending R information signals s₁ . . . s_(R) from said base transceiver station to R remote transceivers T₁ . . . T_(R), respectively, wherein each of said remote transceivers comprises M remote antennas; said method comprising the following steps: (a) selecting R discrimination vectors V₁ . . . V_(R), each of said discrimination vectors having N components; (b) computing an N-component transmission signal vector U, wherein ${U = {\sum\limits_{i = 1}^{R}\quad {V_{i}s_{i}}}};$

(c) transmitting the N components of said transmission signal vector U from said array of base station antennas; (d) receiving, through the M remote antennas of a first of said remote transceivers, an M-component received signal vector Z₁; and (e) computing a reconstructed signal y₁ from said received signal vector Z₁; wherein N≧R and M>1.
 2. The method of claim 1, wherein said discrimination vectors are linearly independent.
 3. The method of claim 2, wherein said discrimination vectors are orthogonal.
 4. The method of claim 1, wherein an i^(th) of said discrimination vectors, V_(i), is selected to minimize a measure of interference caused by the i^(th) information signal s_(i).
 5. The method of claim 4, wherein M×N channel matrices H₁ . . . H_(R) model channels between said array of base station antennas and said remote transceivers T₁ . . . T_(R), respectively, and wherein said measure of interference is: $\sum\limits_{j \neq i}\left| {H_{j}V_{i}} \middle| {}_{2}. \right.$


6. The method of claim 1, wherein an i^(th) of said discrimination vectors, V_(i), is selected to optimize a signal quality of the i^(th) information signal s_(i).
 7. The method of claim 1, wherein said information signals share the same conventional channel.
 8. The method of claim 1, further comprising the step of selecting an M-component signature vector W₁, and wherein y₁=W₁*·Z₁.
 9. The method of claim 8, wherein said signature vector W₁ is selected to maximize a signal quality parameter.
 10. The method of claim 9, wherein an M×N channel matrix H₁ models a channel between said array of base station antennas and said first remote transceiver, and wherein said signal quality parameter is: $\left| {W_{1}^{*}H_{1}V_{1}} \middle| {}_{2}{/\sum\limits_{i \neq 1}} \middle| {W_{1}^{*}H_{1}V_{i}} \middle| {}_{2}. \right.$


11. The method of claim 1, wherein said reconstructed signal y₁ depends nonlinearly upon said received signal vector Z₁.
 12. The method of claim 1, further comprising the following steps for transmitting a remote information signal s₁′ from said first remote transceiver: (a) selecting an M-component remote processing vector W′₁; (b) computing an M-component remote transmission signal vector U′₁, wherein U′₁=W′₁, s′₁; and (c) transmitting the M components of said remote transmission signal vector U′₁ from said M remote antennas of said first remote transceiver.
 13. The method of claim 12, wherein said remote processing vector W′₁ is selected to maximize a remote transmission quality parameter.
 14. The method of claim 13, wherein {e₁ . . . e_(N)} is a set of orthonormal N-component vectors; wherein an N×M channel matrix H′₁ models a channel between said first remote transceiver and said array of base station antennas; and wherein said remote transmission quality parameter is: ${{e_{1}^{*}H_{1}^{\prime}W_{1}^{\prime}}}^{2}/{\sum\limits_{i \neq 1}{{{e_{i}^{*}H_{1}^{\prime}W_{1}^{\prime}}}^{2}.}}$


15. The method of claim 1, further comprising the following steps: (a) receiving, through said array of base station antennas, an N-component base station received signal vector X; (b) selecting R base station signature vectors V′₁ . . . V′_(R), each of said base station signature vectors having N components; and (c) computing base station reconstructed signals u₁ . . . u_(R) corresponding to transmissions sent from said remote transceivers T₁ . . . T_(R), respectively, wherein u_(i)=V′_(i)*·X.
 16. The method of claim 15, wherein an i^(th) of said base station signature vectors, V′_(i), is selected to maximize a base station reception quality parameter.
 17. The method of claim 16, wherein R remote processing vectors W′₁ . . . W′_(R) characterize said transmissions sent from said remote transceivers T₁ . . . T_(R), respectively; wherein N×M channel matrices H′₁ . . . H′_(R) model channels between said remote transceivers T₁ . . . T_(R) and said array of base station antennas, respectively; and wherein said base station reception quality parameter is: $\left| {V_{i}^{\prime*}H_{i}^{\prime}W_{i}^{\prime}} \middle| {}_{2}{/\sum\limits_{j \neq i}} \middle| {V_{i}^{\prime*}H_{j}^{\prime}W_{j}^{\prime}} \middle| {}_{2}. \right.$


18. The method of claim 1, further comprising the following steps: (a) receiving, through said array of base station antennas, an N-component base station received signal vector X; and (b) computing base station reconstructed signals u₁ . . . u_(R) corresponding to transmissions sent from said remote transceivers T₁ . . . T_(R), respectively; wherein said base station reconstructed signals u₁ . . . u_(R) depend nonlinearly upon said received signal vector X.
 19. A method for using a remote transceiver to communicate with a base transceiver station, wherein said remote transceiver comprises M remote antennas, said method comprising the following steps: receiving, through said M remote antennas of said remote transceiver, an M-component received signal vector Z₁ wherein M>1; selecting an M-component signature vector W₁; and computing a reconstructed signal y₁ from said received signal vector Z₁ wherein y_(1 =W) ₁*·Z₁.
 20. The method of claim 19, wherein said signature vector W₁ is selected to maximize a signal quality parameter.
 21. The method of claim 20, wherein R discrimination vectors V₁ . . . V_(R) characterize transmissions from said base transceiver station, each of said discrimination vectors having N components; wherein an M×N channel matrix H₁ models a channel between said base transceiver station and said remote transceiver; and wherein said signal quality parameter is: $\left| {W_{1}^{*}H_{1}V_{1}} \middle| {}_{2}{/\sum\limits_{i \neq 1}} \middle| {W_{1}^{*}H_{1}V_{i}} \middle| {}_{2}. \right.$


22. A method for transmitting a remote information signal s₁′ from a remote transceiver to a base transceiver station, wherein said remote transceiver comprises M remote antennas, wherein M>1, said method comprising the following steps: (a) selecting an M-component remote processing vector W′₁; (b) computing an M-component remote transmission signal vector U′₁, wherein U′₁=W′₁s′₁; and (c) transmitting the M components of said remote transmission signal vector U′₁ from said remote antennas of said remote transceiver.
 23. The method of claim 22, wherein said remote processing vector W′₁ is selected to maximize a remote transmission quality parameter.
 24. The method of claim 23, wherein {e₁ . . . e_(N)} is a set of orthonormal N-component vectors; wherein an N×M channel matrix H′₁ models a channel between said remote transceiver and said base transceiver station; and wherein said remote transmission quality parameter is: ${{e_{1}^{*}H_{1}^{\prime}W_{1}^{\prime}}}^{2}/{\sum\limits_{i \neq 1}{{{e_{i}^{*}H_{1}^{\prime}W_{1}^{\prime}}}^{2}.}}$


25. In a wireless communication system comprising a base transceiver station having an array of base station antennas, a method for simultaneously sending R information signals s₁ . . . s_(R) to R remote transceivers T₁ . . . T_(R), respectively, wherein each of said remote transceivers comprises M remote antennas; said method comprising the following steps: (a) selecting R discrimination vectors V₁ . . . V_(R), each of said discrimination vectors having N components; (b) computing an N-component transmission signal vector U, wherein ${U = {\sum\limits_{i = 1}^{R}\quad {V_{i}s_{i}}}};$

(c) transmitting the N components of said transmission signal vector U from said array of base station antennas; wherein N≧R and M>1.
 26. The method of claim 25, wherein said discrimination vectors are linearly independent.
 27. The method of claim 26, wherein said discrimination vectors are orthogonal.
 28. The method of claim 25, wherein an i^(th) of said discrimination vectors, V_(i), is selected to minimize a measure of interference caused by the i^(th) information signal s_(i).
 29. The method of claim 28, wherein M×N channel matrices H₁ . . . H_(R) model channels between said array of base station antennas and said remote transceivers T₁ . . . T_(R), respectively, and wherein said measure of interference is: $\sum\limits_{j \neq i}\left| {H_{j}V_{i}} \middle| {}_{2}. \right.$


30. The method of claim 25, wherein an i^(th) of said discrimination vectors, V_(i), is selected to optimize a signal quality of the i^(th) information signal s_(i).
 31. The method of claim 25, wherein said information signals share the same conventional channel.
 32. The method of claim 25, further comprising the following steps: (a) receiving, through said array of base station antennas, an N-component base station received signal vector X; (b) selecting R base station signature vectors V′₁ . . . V′_(R), each of said base station signature vectors having N components; and (c) computing base station reconstructed signals u₁ . . . u_(R) corresponding to transmissions sent from said remote transceivers T₁ . . . T_(R), respectively₁ wherein u_(i)=V′₁*·X.
 33. The method of claim 32, wherein an i^(th) of said base station signature vectors, V′_(i), is selected to maximize a base station reception quality parameter.
 34. The method of claim 33, wherein R remote processing vectors W′₁ . . . W′_(R) characterize said transmissions sent from said remote transceivers T₁ . . . T_(R), respectively; wherein N×M channel matrices H′₁ . . . H′_(R) model channels between said remote transceivers T₁ . . . T_(R) and said array of base station antennas, respectively; and wherein said base station reception quality parameter is: $\left| {V_{i}^{\prime*}H_{i}^{\prime}W_{i}^{\prime}} \middle| {}_{2}{/\sum\limits_{j \neq i}} \middle| {V_{i}^{\prime*}H_{j}^{\prime}W_{j}^{\prime}} \middle| {}_{2}. \right.$


35. The method of claim 25, further comprising the following steps: (a) receiving, through said array of base station antennas, an N-component base station received signal vector X; and (b) computing base station reconstructed signals u₁ . . . u_(R) corresponding to transmissions sent from said remote transceivers T₁ . . . T_(R), respectively; wherein said reconstructed signals u₁ . . . u_(R) depend nonlinearly upon said received signal vector X.
 36. A remote transceiver for use in a wireless communication system, wherein said wireless system comprises a base transceiver station, said remote transceiver comprising: M remote antennas, wherein M>1; receiving processing means electrically connected to said remote antennas, for computing a reconstructed signal y₁ from an M-component received signal vector Z₁ received by said M remote antennas, wherein said receive processing means computes said reconstructed signal y₁ using an M-component signature vector W₁ according to the formula: y₁=W₁*·Z₁.
 37. The remote transceiver of claim 36, wherein said receive processing means selects said signature vector W₁ to maximize a signal quality parameter.
 38. The remote transceiver of claim 37, wherein R discrimination vectors V₁ . . . V_(R) characterize transmissions from said base transceiver station, each of said discrimination vectors having N components; wherein an M×N channel matrix H₁ models a channel between said base transceiver station and said remote transceiver; and wherein said signal quality parameter is: $\left| {W_{1}^{*}H_{1}V_{1}} \middle| {}_{2}{/\sum\limits_{i \neq 1}} \middle| {W_{1}^{*}H_{1}V_{i}} \middle| {}_{2}. \right.$


39. A remote transceiver for use in a wireless communication system, wherein said wireless communication system comprises a base transceiver station, said remote transceiver comprising: M remote antennas, wherein M>1; transmit processing means for preparing a remote information signal s₁′ for transmission by the following steps: (a) selecting an M-component remote processing vector W′₁; and (b) computing an M-component remote transmission signal vector U′₁ for transmission from said remote antennas of said remote transceiver, wherein U′₁=W′₁, s′₁.
 40. The remote transceiver of claim 39, wherein said transmit processing means selects said remote processing vector W′₁ to maximize a remote transmission quality parameter.
 41. The remote transceiver of claim 40, wherein {e₁ . . . e_(N)} is a set of orthonormal N-component vectors; wherein an N×M channel matrix H′₁ models a channel between said remote transceiver and said base transceiver station; and wherein said remote transmission quality parameter is: ${{e_{1}^{*}H_{1}^{\prime}W_{1}^{\prime}}}^{2}/\quad {\sum\limits_{i \neq 1}{{{e_{i}^{*}H_{1}^{\prime}W_{1}^{\prime}}}^{2}.}}$


42. A base transceiver station for simultaneously sending R information signals s₁ . . . s_(R) to R remote transceivers T₁ . . . T_(R), respectively, wherein each of said remote transceivers comprises M remote antennas; said base transceiver station comprising: (a) a number N of base station antennas; (b) transmit processing means electrically connected to said base station antennas, for (i) selecting R discrimination vectors V₁ . . . V_(R), each of said discrimination vectors having N components; and (ii) computing an N-component transmission signal vector U for transmission from said base station antennas; wherein ${U = {\sum\limits_{i = 1}^{R}\quad {V_{i}s_{i}}}};$

wherein N≧R and M>1.
 43. The base transceiver station of claim 42, wherein said discrimination vectors are linearly independent.
 44. The base transceiver station of claim 43, wherein said discrimination vectors are orthogonal.
 45. The base transceiver station of claim 42, wherein said transmit processing means selects an i^(th) of said discrimination vectors, V_(i), to minimize a measure of interference caused by the i^(th) information signal s_(i).
 46. The base transceiver station of claim 45, wherein M×N channel matrices H₁ . . . H_(R) model channels between said base station antennas and said remote transceivers T₁ . . . T_(R), respectively, and wherein said measure of interference is: $\sum\limits_{j \neq i}{{{H_{j}V_{i}}}^{2}.}$


47. The base transceiver station of claim 42, wherein said transmit processing means selects an i^(th) of said discrimination vectors, V_(i), to optimize a signal quality of the i^(th) information signal s_(i).
 48. The base transceiver station of claim 42, wherein said information signals share the same conventional channel.
 49. The base transceiver station of claim 42, further comprising receive processing means for processing an N-component base station received signal vector X received by said N base station antennas; wherein said receive processing means (a) selects R base station signature vectors V₁′ . . . V_(R)′, each of said base station signature vectors having N components; and (b) computes base station reconstructed signals u₁ . . . u_(R) corresponding to transmissions from said remote transceivers T₁ . . . T_(R), respectively, wherein u_(i)=V_(i)*·X.
 50. The base transceiver station of claim 49, wherein said receive processing means selects an i^(th) of said base station signature vectors, V_(i)′, to maximize a base station reception quality parameter.
 51. The base transceiver station of claim 50, wherein R remote processing vectors W′₁ . . . W′_(R) characterize said transmissions sent from said remote transceivers T₁ . . . T_(R), respectively; wherein N×M channel matrices H′₁ . . . H′_(R) model channels between said remote transceivers T₁ . . . T_(R) and said base station antennas, respectively; and wherein said base station reception quality parameter is: $\left| {V_{i}^{\prime*}H_{i}^{\prime}W_{i}^{\prime}} \middle| {}_{2}{/\sum\limits_{j \neq i}} \middle| {V_{i}^{\prime*}H_{j}^{\prime}W_{j}^{\prime}} \middle| {}_{2}. \right.$


52. The base transceiver station of claim 42, further comprising receive processing means for processing an N-component base station received signal vector X received by said N base station antennas; wherein said receive processing means computes base station reconstructed signals u₁ . . . u_(R) corresponding to transmissions from said remote transceivers T₁ . . . T_(R), respectively, wherein said base station reconstructed signals u₁ . . . u_(R) depend nonlinearly upon said base station received signal vector X.
 53. In a wireless communication system comprising a base transceiver station having an array of N base station antennas, a method for simultaneously sending R information vectors S₁ . . . S_(R) to R remote transceivers T₁ . . . T_(R), respectively, wherein each of said information vectors comprises p components, and each of said remote transceivers comprises M remote antennas; said method comprising the following steps: (a) selecting R discrimination matrices V₁ . . . V_(R), wherein each of said discrimination matrices is an N×p matrix; (b) computing an N-component transmission signal vector U, wherein ${U = {\sum\limits_{i = 1}^{R}{V_{i}S_{i}}}};{and}$

(c) transmitting the N components of said transmission signal vector U from said array of N base station antennas; wherein N≧R and M>1.
 54. The method of claim 53, wherein p is a function of the time of flight difference between two paths in a channel from said base transceiver station to one of said remote transceivers.
 55. The method of claim 53, wherein p is equal to a number of sub-carrier frequencies transmitted simultaneously by said base transceiver station.
 56. A method of using a remote transceiver to communicate with a base transceiver station, wherein said remote transceiver comprises M remote antennas; said method comprising the following steps: (a) receiving, through said M remote antennas of said remote transceiver, p′ consecutive M-component received signal vectors Z11 . . . Z1p′; and (b) computing a reconstructed signal vector Y1 from p′ signature vectors W11 . . . W1p′ and the p′ consecutive received signal vectors Z11 . . . Z1p′; wherein M>1, ${Y_{1} = {\sum\limits_{i = 1}^{p^{\prime}}{W_{1i}^{*} \cdot Z_{1i}}}},$

and wherein p′ is a function of the time of flight difference between two paths in a channel from said base transceiver station to said remote transceiver.
 57. A base transceiver station for simultaneously sending R information vectors S₁ . . . S_(R) to R remote transceivers T₁ . . . T_(R), respectively, wherein each of said information vectors comprises p components, and each of said remote transceivers comprises M remote antennas; said base transceiver station comprising: (a) a number N of base station antennas; and (b) transmit processing means electrically connected to said base station antennas, for (i) selecting R discrimination matrices V₁ . . . V_(R), wherein each of said discrimination matrices is an N×p matrix; and (ii) computing an N-component transmission signal vector U for transmission from said base station antennas; wherein ${U = {\sum\limits_{i = 1}^{R}\quad {V_{i}S_{i}}}};$

wherein N≧R and M>1.
 58. The base transceiver station of claim 57, wherein p is selected to implement frequency filtering.
 59. A remote transceiver for use in a wireless communication system, wherein said wireless communication system comprises a base transceiver station; said remote transceiver comprising: (a) M remote antennas, wherein M>1; and (b) receiving processing means electrically connected to said remote antennas, for computing a reconstructed signal Y₁ from p′ signature vectors W₁₁ . . . W_(1p′) and p′ consecutive M-component received signal vectors Z₁₁ . . . Z_(1p′) received by said M remote antennas, wherein ${Y_{1} = {\sum\limits_{i = 1}^{p^{\prime}}{W_{1i}^{*} \cdot Z_{1i}}}},$

and wherein p′ is selected to implement time filtering. 